Sequential binary arrays and circulant matrices
نویسندگان
چکیده
منابع مشابه
On Binary Embedding using Circulant Matrices
Binary embeddings provide efficient and powerful ways to perform operations on large scale data. However binary embedding typically requires long codes in order to preserve the discriminative power of the input space. Thus binary coding methods traditionally suffer from high computation and storage costs in such a scenario. To address this problem, we propose Circulant Binary Embedding (CBE) wh...
متن کاملFast binary embeddings with Gaussian circulant matrices: improved bounds
We consider the problem of encoding a finite set of vectors into a small number of bits while approximately retaining information on the angular distances between the vectors. By deriving improved variance bounds related to binary Gaussian circulant embeddings, we largely fix a gap in the proof of the best known fast binary embedding method. Our bounds also show that well-spreadness assumptions...
متن کاملComputation of Maximal Determinants of Binary Circulant Matrices
We describe algorithms for computing maximal determinants of binary circulant matrices of small orders. Here “binary matrix” means a matrix whose elements are drawn from {0, 1} or {−1, 1}. We describe efficient parallel algorithms for the search, using Duval’s algorithm for generation of Lyndon words and the well-known representation of the determinant of a circulant in terms of roots of unity....
متن کاملOn circulant and two-circulant weighing matrices
We employ theoretical and computational techniques to construct new weighing matrices constructed from two circulants. In particular, we construct W (148, 144), W (152, 144), W (156, 144) which are listed as open in the second edition of the Handbook of Combinatorial Designs. We also fill a missing entry in Strassler’s table with answer ”YES”, by constructing a circulant weighing matrix of orde...
متن کاملCirculant Matrices and Differential Privacy
This paper resolves an open problem raised by Blocki et al. (FOCS 2012), i.e., whether other variants of the Johnson-Lindenstrauss transform preserves differential privacy or not? We prove that a general class of random projection matrices that satisfies the Johnson-Lindenstrauss lemma also preserves differential privacy. This class of random projection matrices requires only n Gaussian samples...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
سال: 1987
ISSN: 0263-6115
DOI: 10.1017/s1446788700028615